Constraint optimisation and landscapes
نویسندگان
چکیده
منابع مشابه
Constraint optimisation and landscapes .
We describe an effective landscape introduced in [1] for the analysis of Constraint Satisfaction problems, such as Sphere Packing, K-SAT and Graph Coloring. This geometric construction reexpresses these problems in the more familiar terms of optimisation in rugged energy landscapes. In particular, it allows one to understand the puzzling fact that unsophisticated programs are successful well be...
متن کاملConstraint optimization and landscapes
We describe an effective landscape introduced in [1] for the analysis of Constraint Satisfaction problems, such as Sphere Packing, K-SAT and Graph Coloring. This geometric construction reexpresses these problems in the more familiar terms of optimisation in rugged energy landscapes. In particular, it allows one to understand the puzzling fact that unsophisticated programs are successful well be...
متن کاملMultilevel Landscapes in Combinatorial Optimisation
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which involves recursive coarsening to create a hierarchy of approximations to the original problem. An initial solution is found and then iteratively refined at each level, coarsest to finest. Although the multilevel paradigm has been in use...
متن کاملUncertain Constraint Optimisation Problems
Data uncertainties are inherent in the real world. The uncertain CSP (UCSP) is an extension of classical CSP that models incomplete and erroneous data by coefficients in the constraints whose values are unknown but bounded, for instance by an interval. It resolution is a closure, a set of potential solutions. This paper extends the UCSP model to account for optimisation criteria, by defining th...
متن کاملConstraint Programming and Combinatorial Optimisation in Numberjack
Python benefits from a large and active programming community. Numberjack is a modelling package written in Python for embedding constraint programming and combinatorial optimisation into larger applications. It has been designed to seamlessly and efficiently support a number of underlying combinatorial solvers. Currently, Numberjack supports three constraint programming solvers, one MIP solver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal B
سال: 2008
ISSN: 1434-6028,1434-6036
DOI: 10.1140/epjb/e2008-00052-x